Diameter and k-Center in Sliding Windows

In this paper we develop streaming algorithms for the diameter problem and the k-center clustering problem in the sliding window model. In this model we are interested in maintaining a solution for the N most recent points of the stream. In the diameter problem we would like to maintain two points whose distance approximates the diameter of the point set in the window. Our algorithm computes a (3 + )-approximation and uses O(1/ lnα) memory cells, where α is the ratio of the largest and smallest distance and is assumed to be known in advance. We also prove that under reasonable assumptions obtaining a (3 − )-approximation requires Ω(N1/3) space. For the k-center problem, where the goal is to find k centers that minimize the maximum distance of a point to its nearest center, we obtain a (6 + )-approximation using O(k/ lnα) memory cells and a (4 + )-approximation for the special case k = 2. We also prove that any algorithm for the 2-center problem that achieves an approximation ratio of less than 4 requires Ω(N1/3) space. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity